Antonio Coín Castro
Bayesian Functional Logistic Regression¶
In [1]:
# -- Libraries
from matplotlib import pyplot as plt
from matplotlib.lines import Line2D
import arviz as az
import numpy as np
import pandas as pd
from IPython.display import display
import logging
import skfda
from skfda.preprocessing.dim_reduction.variable_selection import (
RKHSVariableSelection as RKVS,
RecursiveMaximaHunting as RMH
)
import os
from skfda.preprocessing.dim_reduction.feature_extraction import FPCA
from skfda.representation.basis import FDataBasis, Monomial, Fourier
from skfda.representation.grid import FDataGrid
from skfda.ml.classification import (
MaximumDepthClassifier, KNeighborsClassifier, NearestCentroid
)
import warnings
from sklearn.model_selection import (
train_test_split, GridSearchCV, StratifiedKFold
)
from sklearn.exceptions import ConvergenceWarning
from sklearn.svm import SVC, LinearSVC
from sklearn.linear_model import LogisticRegression
import sys
import pickle
import scipy
from multiprocessing import Pool
import utils
from sklearn.base import BaseEstimator, TransformerMixin
from sklearn.pipeline import Pipeline
In [2]:
# -- Configuration
# Extensions
%load_ext autoreload
%autoreload 2
# Plotting configuration
%matplotlib inline
%config InlineBackend.figure_format = 'retina'
plt.rcParams['figure.figsize'] = [6, 4]
plt.style.use('arviz-darkgrid')
NCOLS = 3
def NROWS(x, ncols=NCOLS):
return np.ceil(x/ncols).astype('int')
# Randomness and reproducibility
SEED = 42
np.random.seed(SEED)
rng = np.random.default_rng(SEED)
# Floating point precision for display
np.set_printoptions(precision=3, suppress=True)
pd.set_option("display.precision", 3)
# Multiprocessing
N_CORES = 4
# Ignore warnings
np.seterr(over='ignore', divide='ignore')
os.environ["PYTHONWARNINGS"] = 'ignore::UserWarning'
We consider the binary $\{0,1\}$-model
$$ \mathbb P(Y=1\mid X=x) = \frac{1}{1 + \exp\{-\alpha_0-\Psi^{-1}_{x}(\alpha)\}}, $$i.e., each $Y_i$ can be seen as a Bernoulli random variable $\mathcal B(p(x_i))$ with
$$ p(x_i)\equiv p_i=\mathbb P(Y_i=1\mid X_i=x_i) = \frac{1}{1 + \exp\left\{-\alpha_0-\displaystyle\sum_{j=1}^p \beta_jx_i(\tau_j)\right\}}. $$Note that $\mathbb E[Y_i]=p_i$ and $\operatorname{Var}(Y_i)=p_i(1-p_i)$.
The prior distributions we choose are:
\begin{align*} \pi(\alpha_0, \sigma^2) & \propto 1/\sigma^2, \\ \tau & \sim \mathscr U([0, 1]^p), \\ \beta\mid \tau, \sigma^2 & \sim \mathcal N\left(b_0, g\sigma^2\left[\mathcal X_\tau' \mathcal X_\tau + \eta \lambda_{\text{max}}(\mathcal X_\tau' \mathcal X_\tau)\right]^{-1}\right). \end{align*}Note that for computational reasons we will work with $\log \sigma$ instead of $\sigma^2$, and hence the associated prior distribution is
$$ \pi(\alpha_0, \log\sigma) \propto 1. $$Writing the parameter vector as $\theta = (\beta, \tau, \alpha_0, \log \sigma)$, the joint log-posterior probability is:
$$ \log \pi(\beta, \tau, \alpha_0, \log\sigma\mid Y) \propto \sum_{i=1}^n \left[ \left(\alpha_0 + \Psi^{-1}_{x_i}(\alpha)\right)y_i - \log\left(1 + \exp\left\{\alpha_0 + \Psi_{x_i}^{-1}(\alpha)\right\}\right)\right] + \frac{1}{2}\log |G_\tau| - p\log \sigma -\frac{1}{2g\sigma^2} (\beta - b_0)'G_\tau(\beta - b_0). $$The metrics considered for model evaluation will be:
- Accuracy.
Example dataset¶
We generate a toy dataset with $n=100$ functional regressors $X_i(t) \sim GP(0, K(s, t))$, a response variable given by either a $L^2$ model or a "simple" RKHS function, and a value of $\alpha_0=-0.5$. More precisely, we choose one of
$$ Y_i \sim \mathcal B\left(\frac{1}{1 + \exp\left\{0.5 + 5X_i(0.1) - 10X_i(0.8)\right\}}\right) $$or
$$ Y_i \sim \mathcal B\left(\frac{1}{1 + \exp\left\{0.5 -\int_0^1 \beta(t)X_i(t)\, dt\right\}}\right), $$where $\beta(t) \in L^2[0, 1]$.
Another possibility is to generate a dataset from two different Gaussian processes, and label them according to the (known) distribution of $X^{(j)}$.
We consider a regular grid of $N=100$ points on $[0, 1]$. In addition, we center the $X_i$ so that they have zero mean when fed to the sampling algorithms.
We also generate a test dataset with $n_{\text{test}}=50$ regressors for model evaluation.
In [3]:
# -- Data generation parameters
SYNTHETIC_DATA = True
REAL_DATA = "Medflies"
MODEL_GEN = "RKHS" # 'L2', 'RKHS' or 'MIXTURE'
STANDARDIZE_PREDICTORS = False
BASIS_REPRESENTATION = True
N_BASIS = 7
NOISE = 0.05
kernel_fn = utils.fractional_brownian_kernel
kernel_fn2 = utils.brownian_kernel
beta_coef = utils.cholaquidis_scenario3
basis = Fourier(n_basis=N_BASIS)
In [4]:
# -- Dataset generation
if SYNTHETIC_DATA:
n_train, n_test = 100, 50
N = 100
grid = np.linspace(1./N, 1., N)
beta_true = np.array([-5., 10.])
tau_true = np.array([0.1, 0.8])
alpha0_true = -0.5
if MODEL_GEN == "MIXTURE":
x, y = utils.generate_classification_dataset(
grid, kernel_fn, kernel_fn2,
n_train + n_test, rng=rng)
else:
if MODEL_GEN == "L2":
x, y_lin = utils.generate_gp_l2_dataset(
grid, kernel_fn,
n_train + n_test, beta_coef,
alpha0_true, 0.0, rng=rng
)
elif MODEL_GEN == "RKHS":
x, y_lin = utils.generate_gp_rkhs_dataset(
grid, kernel_fn,
n_train + n_test, beta_true, tau_true,
alpha0_true, 0.0, rng=rng
)
else:
raise ValueError("Invalid model generation strategy.")
# Transform linear response for logistic model
y = utils.transform_linear_response(y_lin, noise=NOISE, rng=rng)
# Train/test split
X, X_test, Y, Y_test = train_test_split(
x, y, train_size=n_train, stratify=y,
random_state=SEED)
# Create FData object
X_fd = skfda.FDataGrid(X, grid)
X_test_fd = skfda.FDataGrid(X_test, grid)
else:
if REAL_DATA == "Medflies":
x, y = skfda.datasets.fetch_medflies(return_X_y=True)
elif REAL_DATA == "Growth":
x, y = skfda.datasets.fetch_growth(return_X_y=True)
else:
raise ValueError("REAL_DATA must be 'Medflies' or 'Growth'.")
X_fd, X_test_fd, Y, Y_test = train_test_split(
x, y, train_size=0.8, stratify=y, random_state=SEED)
N = len(X_fd.grid_points[0])
grid = np.linspace(1./N, 1., N) # TODO: use (normalized) real grid
n_train, n_test = len(X_fd.data_matrix), len(X_test_fd.data_matrix)
if BASIS_REPRESENTATION:
X_fd = X_fd.to_basis(basis).to_grid(X_fd.grid_points[0])
X_test_fd = X_test_fd.to_basis(basis).to_grid(X_fd.grid_points[0])
if STANDARDIZE_PREDICTORS:
X_sd = X_fd.data_matrix.std(axis=0)
else:
X_sd = np.ones(X_fd.data_matrix.shape[1:])
# Standardize data
X_m = X_fd.mean(axis=0)
X_fd = (X_fd - X_m)/X_sd
X = X_fd.data_matrix.reshape(-1, N)
X_test_fd = (X_test_fd - X_m)/X_sd
X_test = X_test_fd.data_matrix.reshape(-1, N)
if SYNTHETIC_DATA:
n_samples = n_train//2
elif REAL_DATA == "Medflies":
n_samples = n_train//5
else:
n_samples = n_train
utils.plot_dataset_classification(X, Y, figsize=(10, 4), n_samples=n_samples)
Common model hyperparameters¶
In our algorithms, we consider an unconstrained tranformed parameter space $\tilde \Theta=\mathbb{R}^{2\hat p+2}$ via the bijections
- $\tau_j \mapsto \operatorname{logit}(\tau_j)$.
- $\sigma^2 \mapsto \log\sigma$.
In [5]:
# -- Model hyperparameters
p_hat = 3
g = 5
eta = 0.1
TRANSFORM_TAU = False
FIT_SK = True
In [6]:
# -- Names and labels
# Names of parameters
theta_names = ["β", "τ", "α0", "σ2"]
if TRANSFORM_TAU:
theta_names_ttr = ["β", "logit τ", "α0", "log σ"]
else:
theta_names_ttr = ["β", "τ", "α0", "log σ"]
theta_names_aux = ["α0 and log σ"]
# Grouped labels
theta_labels_grouped = [r"$\beta$", r"$\tau$", r"$\alpha_0$", r"$\sigma^2$"]
# Individual labels
theta_labels = []
for i in range(p_hat):
theta_labels.append(fr"$\beta_{i + 1}$")
for i in range(p_hat):
theta_labels.append(fr"$\tau_{i + 1}$")
theta_labels.append(theta_labels_grouped[-2])
theta_labels.append(theta_labels_grouped[-1])
# Labels for Arviz
theta_labeller = az.labels.MapLabeller(
var_name_map=dict(zip(theta_names[-2:], theta_labels_grouped[-2:])),
coord_map={"projection": dict(
zip(np.arange(p_hat), np.arange(1, p_hat + 1)))}
)
# Dimension of parameter vector
theta_ndim = len(theta_labels)
# Dimension of grouped parameter vector
theta_ndim_grouped = len(theta_names)
# Names of results columns
results_columns = ["Estimator", "Features", "Accuracy"]
In [7]:
# -- Parameter space and miscellaneous
if TRANSFORM_TAU:
tau_ttr = utils.Logit()
else:
tau_ttr = utils.Identity()
# Parameter space
theta_space = utils.ThetaSpace(
p_hat, grid, theta_names, theta_names_ttr, theta_labels, tau_ttr=tau_ttr)
# Statistics for posterior predictive checks
statistics = [
("min", np.min),
("max", np.max),
("median", np.median),
("mean", np.mean),
("std", np.std)]
# Point estimates for posterior distribution
point_estimates = ["mode", "mean", "median"]
Sklearn model comparison¶
Currently there is a bug when trying to fit an already fitted FPCA object. It checks "if not self.weights" when it should be checking "if self.weights is None" (weights is an ndarray).
In [8]:
# -- Custom CV and transformers
def cv_sk(classifiers, folds, X, Y, X_test, Y_test, verbose=False):
df_metrics_sk = pd.DataFrame(columns=results_columns)
for i, (name, pipe, params) in enumerate(classifiers):
if verbose:
print(f"Fitting {name}...")
clf_cv = GridSearchCV(pipe, params, scoring="accuracy",
n_jobs=N_CORES, cv=folds)
clf_cv.fit(X, Y)
Y_hat_sk = clf_cv.predict(X_test)
metrics_sk = utils.classification_metrics(Y_test, Y_hat_sk)
if name == "sk_fknn":
n_features = f"K={clf_cv.best_params_['clf__n_neighbors']}"
elif name == "sk_mdc" or name == "sk_fnc":
n_features = X.data_matrix.shape[1]
elif "svm" in name:
n_features = clf_cv.best_estimator_["clf"].n_features_in_
else:
if isinstance(clf_cv.best_estimator_["clf"].coef_[0], FDataBasis):
coef = clf_cv.best_estimator_["clf"].coef_[0].coefficients[0]
else:
coef = clf_cv.best_estimator_["clf"].coef_[0]
n_features = sum(~np.isclose(coef, 0))
df_metrics_sk.loc[i] = [
name,
n_features,
metrics_sk["acc"]]
df_metrics_sk.sort_values(
results_columns[-1], inplace=True, ascending=False)
return df_metrics_sk
def bayesian_var_sel(idata, theta_space, names,
X, Y, X_test, Y_test, folds,
prefix, point_est='mode',
verbose=False):
grid = theta_space.grid
p_hat = theta_space.p
tau_hat = utils.point_estimate(
idata, point_est, names)[p_hat:2*p_hat]
idx_hat = np.abs(grid - tau_hat[:, np.newaxis]).argmin(1)
classifiers_var_sel = []
Cs = np.logspace(-4, 4, 20)
params_clf = {"clf__C": Cs}
params_svm = {"clf__gamma": ['auto', 'scale']}
# Emcee+LR
classifiers_var_sel.append((f"{prefix}_{point_est}+sk_logistic",
Pipeline([
("var_sel", VariableSelection(grid, idx_hat)),
("data_matrix", DataMatrix()),
("clf", LogisticRegression(random_state=SEED))]),
params_clf
))
# Emcee+SVM Linear
classifiers_var_sel.append((f"{prefix}_{point_est}+sk_svm_lin",
Pipeline([
("var_sel", VariableSelection(grid, idx_hat)),
("data_matrix", DataMatrix()),
("clf", LinearSVC(random_state=SEED))]),
params_clf
))
# Emcee+SVM RBF
classifiers_var_sel.append((f"{prefix}_{point_est}+sk_svm_rbf",
Pipeline([
("var_sel", VariableSelection(grid, idx_hat)),
("data_matrix", DataMatrix()),
("clf", SVC(kernel='rbf'))]),
{**params_svm, **params_clf}
))
df_metrics_var_sel = cv_sk(classifiers_var_sel, folds,
X_fd, Y, X_test_fd, Y_test, verbose)
return df_metrics_var_sel
class FeatureSelector(BaseEstimator, TransformerMixin):
def __init__(self, p=1):
self.p = p
def fit(self, X, y=None):
N = X.shape[1]
self.idx_ = np.linspace(0, N - 1, self.p).astype(int)
return self
def transform(self, X, y=None):
return X[:, self.idx_]
class DataMatrix(BaseEstimator, TransformerMixin):
def fit(self, X, y=None):
self.N = len(X.grid_points[0])
return self
def transform(self, X, y=None):
return X.data_matrix.reshape(-1, self.N)
class Basis(BaseEstimator, TransformerMixin):
def __init__(self, basis=Fourier()):
self.basis = basis
def fit(self, X, y=None):
return self
def transform(self, X, y=None):
return X.to_basis(self.basis)
class VariableSelection(BaseEstimator, TransformerMixin):
def __init__(self, grid=None, idx=None):
self.grid = grid
self.idx = idx
self.idx.sort()
def fit(self, X, y=None):
return self
def transform(self, X, y=None):
return FDataGrid(X.data_matrix[:, self.idx], self.grid[self.idx])
In [9]:
# -- Select family of classifiers
classifiers = []
Cs = np.logspace(-4, 4, 20)
n_selected = [5, 10, 15, 20, 25, X.shape[1]]
n_components = [2, 3, 4, 5, 6, 10]
n_basis = [3, 5, 7, 9, 11]
basis_fourier = [Fourier(n_basis=p) for p in n_basis]
n_neighbors = [3, 5, 7]
params_clf = {"clf__C": Cs}
params_svm = {"clf__gamma": ['auto', 'scale']}
params_select = {"selector__p": n_selected}
params_fpca = {"dim_red__n_components": n_components}
params_var_sel = {"var_sel__n_features_to_select": n_components}
params_basis = {"basis__basis": basis_fourier}
params_knn = {"clf__n_neighbors": n_neighbors,
"clf__weights": ['uniform', 'distance']}
params_depth = {"clf__depth_method": [skfda.exploratory.depth.ModifiedBandDepth(),
skfda.exploratory.depth.IntegratedDepth()]}
# Manual+LR
classifiers.append(("manual_sel+sk_logistic",
Pipeline([
("data_matrix", DataMatrix()),
("selector", FeatureSelector()),
("clf", LogisticRegression(random_state=SEED))]),
{**params_clf, **params_select}
))
# FPCA+LR
classifiers.append(("fpca+sk_logistic",
Pipeline([
("dim_red", FPCA()), # Retains scores only
("clf", LogisticRegression(random_state=SEED))]),
{**params_fpca, **params_clf}
))
# RKVS+LR
classifiers.append(("rkvs+sk_logistic",
Pipeline([
("var_sel", RKVS()),
("clf", LogisticRegression(random_state=SEED))]),
params_var_sel
))
# RMH+LR
classifiers.append(("rmh+sk_logistic",
Pipeline([
("var_sel", RMH()),
("clf", LogisticRegression(random_state=SEED))]),
{}
))
# Manual+SVM Linear
classifiers.append(("manual_sel+sk_svm_lin",
Pipeline([
("data_matrix", DataMatrix()),
("selector", FeatureSelector()),
("clf", LinearSVC(random_state=SEED))]),
{**params_select, **params_clf}
))
# FPCA+SVM Linear
classifiers.append(("fpca+sk_svm_lin",
Pipeline([
("dim_red", FPCA()), # Retains scores only
("clf", LinearSVC(random_state=SEED))]),
{**params_fpca, **params_clf}
))
# RKVS+SVM Linear
classifiers.append(("rkvs+sk_svm_lin",
Pipeline([
("var_sel", RKVS()),
("clf", LinearSVC(random_state=SEED))]),
{**params_var_sel, **params_clf}
))
# RMH+SVM Linear
classifiers.append(("rmh+sk_svm_lin",
Pipeline([
("var_sel", RMH()),
("clf", LinearSVC(random_state=SEED))]),
params_clf
))
# Manual+SVM RBF
classifiers.append(("manual_sel+sk_svm_rbf",
Pipeline([
("data_matrix", DataMatrix()),
("selector", FeatureSelector()),
("clf", SVC(kernel='rbf'))]),
{**params_select, **params_clf, **params_svm}
))
# FPCA+SVM RBF
classifiers.append(("fpca+sk_svm_rbf",
Pipeline([
("dim_red", FPCA()), # Retains scores only
("clf", SVC(kernel='rbf'))]),
{**params_fpca, **params_clf, **params_svm}
))
# RKVS+SVM RBF
classifiers.append(("rkvs+sk_svm_rbf",
Pipeline([
("var_sel", RKVS()),
("clf", SVC(kernel='rbf'))]),
{**params_var_sel, **params_clf, **params_svm}
))
# RMH+SVM RBF
classifiers.append(("rmh+sk_svm_rbf",
Pipeline([
("var_sel", RMH()),
("clf", SVC(kernel='rbf'))]),
{**params_clf, **params_svm}
))
# Maximum Depth Classifier
classifiers.append(("sk_mdc",
Pipeline([
("clf", MaximumDepthClassifier())]),
params_depth
))
# KNeighbors Functional Classification
classifiers.append(("sk_fknn",
Pipeline([
("clf", KNeighborsClassifier())]),
params_knn
))
# Nearest Centroid Functional Classification
classifiers.append(("sk_fnc",
Pipeline([
("clf", NearestCentroid())]),
{}
))
In [10]:
# -- Fit models and show metrics
folds = StratifiedKFold(shuffle=True, random_state=SEED)
if FIT_SK:
df_metrics_sk = cv_sk(classifiers, folds, X_fd, Y,
X_test_fd, Y_test, verbose=True)
display(df_metrics_sk.style.hide_index())
Maximum Likelihood Estimator¶
In [11]:
# -- Negative log-likelihood definition in transformed parameter space
def neg_ll(theta_tr, X, Y, theta_space):
"""Transformed parameter vector 'theta_tr' is (β, τ, α0, log σ)."""
n, N = X.shape
grid = theta_space.grid
assert len(theta_tr) == theta_space.ndim
beta, tau, alpha0, _ = theta_space.get_params(theta_tr)
idx = np.abs(grid - tau[:, np.newaxis]).argmin(1)
X_tau = X[:, idx]
lin_comp = alpha0 + X_tau@beta
return -np.sum(lin_comp*Y - np.logaddexp(0, lin_comp))
In [12]:
# -- MLE estimation
method_mle = 'L-BFGS-B' # 'Nelder-Mead', 'Powell' or 'L-BFGS-B'
strategy_mle = 'global'
theta_init = theta_space.forward(
np.array([0.0]*p_hat + [0.5]*p_hat + [0.0] + [1.0]))
if TRANSFORM_TAU:
bounds = None
else:
bounds = ([(None, None)]*p_hat
+ [(theta_space.tau_lb, theta_space.tau_ub)]*p_hat
+ [(None, None)]
+ [(None, None)])
if strategy_mle == 'local':
mle_theta_tr = scipy.optimize.minimize(
neg_ll,
x0=theta_init,
bounds=bounds,
method=method_mle,
args=(X, Y, theta_space)
).x
bic = utils.compute_bic(theta_space, neg_ll, mle_theta_tr, X, Y)
elif strategy_mle == 'global':
mles = np.zeros((N_CORES, theta_space.ndim))
def optimizer(rng):
return scipy.optimize.basinhopping(
neg_ll,
x0=theta_init,
seed=rng,
minimizer_kwargs={"args": (X, Y, theta_space),
"method": method_mle,
"bounds": bounds}
).x
with Pool(N_CORES) as p:
print(f"-- Computing MLE with {N_CORES} independent runs --")
rngs = [np.random.default_rng(SEED + i) for i in range(N_CORES)]
mles = p.map(optimizer, rngs)
bics = utils.bic = utils.compute_bic(theta_space, neg_ll, mles, X, Y)
mle_theta_tr = mles[np.argmin(bics)]
bic = bics[np.argmin(bics)]
else:
raise ValueError('Invalid strategy for MLE computation.')
mle_theta = theta_space.backward(mle_theta_tr)
Y_hat_mle = utils.generate_response_logistic(X_test, mle_theta)
df_metrics_mle = pd.DataFrame(columns=results_columns)
metrics_mle = utils.classification_metrics(Y_test, Y_hat_mle)
df_metrics_mle.loc[0] = [
"mle",
p_hat,
metrics_mle["acc"]
]
print(f"\nBIC: {bic:.3f}")
print("MLE:")
display(pd.DataFrame(zip(theta_space.labels, mle_theta),
columns=["", "MLE"]).style.hide_index())
print("Classification metrics:")
df_metrics_mle.style.hide_index()
Out[12]:
The Ensemble Sampler and the emcee library¶
In [13]:
import emcee
Model¶
We only need to provide the sampler with the logarithm of the posterior distribution. For clarity we split up its computation in log-prior and log-likelihood, although for a more efficient implementation it should all be in one function.
In [14]:
# -- Log-posterior model
def log_prior(theta_tr):
"""Global parameters (for efficient parallelization):
X, b0, g, eta, theta_space"""
assert len(theta_tr) == theta_space.ndim
n, N = X.shape
p = theta_space.p
grid = theta_space.grid
theta = theta_space.backward(theta_tr)
beta, tau, alpha0, sigma2 = theta_space.get_params(theta)
log_sigma = theta_space.get_sigma2(theta_tr)
if not TRANSFORM_TAU:
if (tau < theta_space.tau_lb).any() or (tau > theta_space.tau_ub).any():
return -np.inf
# Transform variables
b = beta - b0
# Compute and regularize G_tau
idx = np.abs(grid - tau[:, np.newaxis]).argmin(1)
X_tau = X[:, idx]
G_tau = X_tau.T@X_tau
G_tau = (G_tau + G_tau.T)/2. # Enforce symmetry
G_tau_reg = G_tau + eta * \
np.max(np.linalg.eigvalsh(G_tau))*np.identity(p)
# Compute log-prior
log_prior = (0.5*utils.logdet(G_tau_reg)
- p*log_sigma
- b.T@G_tau_reg@b/(2*g*sigma2))
return log_prior
def log_likelihood(theta_tr, Y):
"""Global parameters (for efficient parallelization):
X, theta_space, return_ll"""
n, N = X.shape
grid = theta_space.grid
assert len(theta_tr) == theta_space.ndim
beta, tau, alpha0, _ = theta_space.get_params(theta_tr)
idx = np.abs(grid - tau[:, np.newaxis]).argmin(1)
X_tau = X[:, idx]
lin_comp = alpha0 + X_tau@beta
ll_pointwise = lin_comp*Y - np.logaddexp(0, lin_comp)
ll = np.sum(ll_pointwise)
if return_ll:
return ll, ll_pointwise
else:
return ll
def log_posterior(theta_tr, Y):
"""Global parameters (for efficient parallelization):
X, rng, return_pp, return_ll, theta_space"""
# Compute log-prior
lp = log_prior(theta_tr)
if not np.isfinite(lp):
if return_pp and return_ll:
return (-np.inf, np.full_like(Y, -1.0),
np.full_like(Y, -1), np.full_like(Y, -np.inf))
elif return_pp:
return -np.inf, np.full_like(Y, -1.0), np.full_like(Y, -1)
elif return_ll:
return -np.inf, np.full_like(Y, -np.inf)
else:
return -np.inf
# Compute log-likelihood (and possibly pointwise log-likelihood)
if return_ll:
ll, ll_pointwise = log_likelihood(theta_tr, Y)
else:
ll = log_likelihood(theta_tr, Y)
# Compute log-posterior
lpos = lp + ll
# Compute posterior predictive samples
if return_pp:
theta = theta_space.backward(theta_tr)
pp_y, pp_p = utils.generate_response_logistic(
X, theta, return_p=True, rng=rng)
# Return information
if return_pp and return_ll:
return lpos, pp_p, pp_y, ll_pointwise
elif return_pp:
return lpos, pp_p, pp_y
elif return_ll:
return lpos, ll_pointwise
else:
return lpos
Experiments¶
We set up the initial points of the chains to be in a random neighbourhood around the MLE to increase the speed of convergence.
In [15]:
def run_emcee(n_walkers, n_iter_initial, n_iter, moves,
thin, thin_pp, return_pp, return_ll):
# -- Run sampler
with Pool(N_CORES) as pool:
print(
f"-- Running affine-invariant ensemble sampler with {N_CORES} cores --")
sampler = emcee.EnsembleSampler(
n_walkers, theta_ndim, log_posterior,
pool=pool, args=(Y,),
moves=moves)
print("Tuning phase...")
state = sampler.run_mcmc(
p0, n_iter_initial, progress='notebook',
store=False)
sampler.reset()
print("MCMC sampling...")
sampler.run_mcmc(state, n_iter, progress='notebook')
print(
f"Mean acceptance fraction: {100*np.mean(sampler.acceptance_fraction):.3f}%")
logging.disable(sys.maxsize) # Disable logger
# Analyze autocorrelation and set burn-in and thinning values
autocorr = sampler.get_autocorr_time(quiet=True)
max_autocorr = np.max(autocorr)
if (np.isfinite(autocorr)).all():
burn = int(3*max_autocorr)
else:
print("Some autocorrelation value is not finite")
burn = 500
logging.disable(logging.NOTSET) # Re-enable logger
# Get InferenceData object
idata_emcee = utils.emcee_to_idata(
sampler, theta_space, burn, thin,
["p_star", "y_star"] if return_pp else [],
return_ll)
print("\n-- Summary statistics --")
display(utils.summary(idata_emcee, var_names=theta_names,
kind="stats", labeller=theta_labeller))
# -- Compute metrics using several point estimates
df_metrics_emcee = pd.DataFrame(columns=results_columns)
# Posterior mean estimate
pp_test_p, pp_test_y = utils.generate_pp(
idata_emcee, X_test, theta_names,
thin_pp, rng=rng,
kind='classification')
print("Computing metrics...", end="\r")
Y_hat_pp_mean = [utils.threshold(y) for y in pp_test_p.mean(axis=(0, 1))]
Y_hat_pp_vote = [utils.threshold(y) for y in pp_test_y.mean(axis=(0, 1))]
metrics_pp_mean = utils.classification_metrics(Y_test, Y_hat_pp_mean)
metrics_pp_vote = utils.classification_metrics(Y_test, Y_hat_pp_vote)
df_metrics_emcee.loc[0] = [
"emcee_posterior_mean",
p_hat,
metrics_pp_mean["acc"]
]
df_metrics_emcee.loc[1] = [
"emcee_posterior_vote",
p_hat,
metrics_pp_vote["acc"]
]
# Point estimates
for i, pe in enumerate(point_estimates):
Y_hat_pe = utils.point_predict(
X_test, idata_emcee,
theta_names, pe,
kind='classification')
metrics_pe = utils.classification_metrics(Y_test, Y_hat_pe)
df_metrics_emcee.loc[i + 2] = [
"emcee_" + pe,
p_hat,
metrics_pe["acc"]
]
# Bayesian variable selection
for pe in point_estimates:
df_metrics_var_sel = bayesian_var_sel(
idata_emcee, theta_space, theta_names, X_fd,
Y, X_test_fd, Y_test, folds, prefix="emcee",
point_est=pe)
df_metrics_emcee = df_metrics_emcee.append(df_metrics_var_sel)
df_metrics_emcee = df_metrics_emcee.append(df_metrics_mle)
if FIT_SK:
df_metrics_emcee = df_metrics_emcee.append(df_metrics_sk)
df_metrics_emcee.sort_values(
results_columns[-1], inplace=True, ascending=False)
print("-- Classification metrics --")
display(df_metrics_emcee.style.hide_index())
return sampler, idata_emcee, df_metrics_emcee
In [16]:
# -- Sampler parameters
n_walkers = 64
n_iter_initial = 100
n_iter = 1000
return_pp = True
return_ll = False
frac_random = 0.3
sd_beta_init = 1.0
sd_tau_init = 0.2
mean_alpha0_init = 0.0
sd_alpha0_init = 1.0
param_sigma2_init = 2.0 # shape parameter in inv_gamma distribution
sd_sigma2_init = 1.0
moves = [
(emcee.moves.StretchMove(), 0.7),
(emcee.moves.WalkMove(), 0.3)
]
thin = 1
thin_pp = 5
FAST_RUN = True
In [17]:
# -- Run sampler
# Start every walker in a (random) neighbourhood around the MLE
p0 = utils.weighted_initial_guess_around_value(
theta_space, mle_theta_tr, sd_beta_init, sd_tau_init,
mean_alpha0_init, sd_alpha0_init, param_sigma2_init,
sd_sigma2_init, n_walkers=n_walkers, rng=rng,
frac_random=frac_random)
b0 = mle_theta_tr[theta_space.beta_idx]
if FAST_RUN:
sampler, idata_emcee, df_metrics_emcee_full = run_emcee(
n_walkers, n_iter_initial, n_iter,
moves, thin, thin_pp, return_pp, return_ll)
else:
with Pool(N_CORES) as pool:
print(
f"-- Running affine-invariant ensemble sampler with {N_CORES} cores --")
sampler = emcee.EnsembleSampler(
n_walkers, theta_ndim, log_posterior,
pool=pool, args=(Y,),
moves=moves)
print("Tuning phase...")
state = sampler.run_mcmc(
p0, n_iter_initial, progress='notebook',
store=False)
sampler.reset()
print("MCMC sampling...")
sampler.run_mcmc(state, n_iter, progress='notebook')
print(
f"Mean acceptance fraction: {100*np.mean(sampler.acceptance_fraction):.3f}%")
Analysis¶
We analyze the samples of all chains, discarding a few times the integrated autocorrelation times worth of samples. We could also perform thinning and take only every $k$-th value.
In [18]:
# -- Sampler statistics and trace (with burn-in and thinning)
logging.disable(sys.maxsize) # Disable logger
# Analyze autocorrelation and set burn-in and thinning values
autocorr = sampler.get_autocorr_time(quiet=True)
max_autocorr = np.max(autocorr)
if (np.isfinite(autocorr)).all():
burn = int(3*max_autocorr)
else:
print("Some autocorrelation value is not finite")
burn = 500
# Get trace of samples
trace_flat = utils.get_trace_emcee(sampler, theta_space, burn, thin, flat=True)
# Get InferenceData object
idata_emcee = utils.emcee_to_idata(
sampler, theta_space, burn, thin,
["p_star", "y_star"] if return_pp else [],
return_ll)
# Update and show autocorrelation
autocorr_thin = sampler.get_autocorr_time(discard=burn, thin=thin, quiet=True)
logging.disable(logging.NOTSET) # Re-enable logger
pd.DataFrame(
zip(theta_labels, autocorr_thin, len(trace_flat)/autocorr_thin),
columns=["", "Autocorrelation times", "Effective i.i.d samples"]
).style.hide_index()
Out[18]:
In [19]:
utils.summary(idata_emcee, var_names=theta_names,
kind="stats", labeller=theta_labeller)
Out[19]:
In [20]:
az.plot_trace(idata_emcee, labeller=theta_labeller,
combined=True, var_names=theta_names)
print("Combined density and trace plot:")
In [21]:
az.plot_posterior(idata_emcee, labeller=theta_labeller, point_estimate='mode',
grid=(NROWS(theta_ndim), NCOLS), textsize=20,
var_names=theta_names)
print("Marginal posterior distributions:")
In this case, since the outcome variable is binary, we plot the distribution of $T(Y^*)$ to visually compare it with $T(Y)$, where $T$ is the number of $1$s in the sample (the number of successes).
We also show a separation plot, in which the predicted probabilities $\hat p_i$ (suitably averaged for each chain and sample) are ordered in an ascending manner, and then a vertical line is drawn on each of them either in a dark color (if $y_i$ is 1) or a light color (if $y_i$ is 0). In a perfect model, all the dark lines would be on the rightmost part, effectively "separating" the samples.
In [22]:
# -- Generate and plot posterior predictive checks from X
if "posterior_predictive" not in idata_emcee:
pp_p, pp_y = utils.generate_pp(
idata_emcee, X, theta_names,
rng=rng, kind='classification')
utils.pp_to_idata([pp_p, pp_y], idata_emcee,
["p_star", "y_star"], merge=True)
else:
pp_p = idata_emcee.posterior_predictive['p_star'].to_numpy()
pp_y = idata_emcee.posterior_predictive['y_star'].to_numpy().astype(int)
# Posterior predictive checks
fig, axs = plt.subplots(1, 2, figsize=(10, 4))
plt.suptitle(r"Posterior predictive checks on $X$")
n_success = pp_y.reshape(-1, len(Y)).sum(axis=1)
az.plot_dist(n_success, label=r"$T(Y^*)$", ax=axs[0])
axs[0].axvline(n_success.mean(), ls="--", color="orange",
lw=2, label=r"$\overline{T(Y^*)}$")
axs[0].axvline(Y.sum(), ls="--", color="red",
lw=2, label=r"T(Y)")
axs[0].set_title("T = No. of successes")
axs[0].legend()
axs[0].set_yticks([])
axs[0].tick_params(labelsize=8)
az.plot_bpv(idata_emcee, kind='t_stat', t_stat='mean', data_pairs={
'y_obs': 'y_star'}, plot_mean=False, ax=axs[1], bpv=False)
axs[1].axvline(Y.mean(), ls="--", color="r",
lw=2, label=r"$\bar Y$")
handles, labels = axs[1].get_legend_handles_labels()
handles.extend([Line2D([0], [0], label=r"Distribution of $\bar Y^*$")])
axs[1].legend(handles=handles)
# Separation plot
az.plot_separation(idata_emcee, y="y_obs", y_hat="p_star", y_hat_line=True,
figsize=(10, 1), legend=False)
plt.title("Separation plot", fontsize=12)
# Show Bayesian p-values
for name, stat in statistics:
bpv = utils.bpv(pp_y, Y, stat)
print(f"bpv [T={name}]: {bpv:.3f}")
In [23]:
az.plot_autocorr(idata_emcee, combined=True, var_names=theta_names,
grid=(NROWS(theta_ndim), NCOLS), labeller=theta_labeller)
print("Combined autocorrelation times:")
Out-of-sample predictions¶
In [24]:
# -- Generate and plot posterior predictive samples from X_test
pp_test_p, pp_test_y = utils.generate_pp(
idata_emcee, X_test, theta_names,
rng=rng, kind='classification')
idata_pp_test = utils.pp_to_idata(
[pp_test_p, pp_test_y], idata_emcee, ["p_star", "y_star"], y_obs=Y_test)
# Posterior predictive checks
fig, axs = plt.subplots(1, 2, figsize=(10, 4))
plt.suptitle(r"Posterior predictive checks on $X_{test}$")
n_success_test = pp_test_y.reshape(-1, len(Y_test)).sum(axis=1)
az.plot_dist(n_success_test, label=r"$T(Y_{test}^*)$", ax=axs[0])
axs[0].axvline(n_success_test.mean(), ls="--", color="orange",
lw=2, label=r"$\overline{T(Y_{test}^*)}$")
axs[0].axvline(Y_test.sum(), ls="--", color="red",
lw=2, label=r"$T(Y_{test})$")
axs[0].set_title("T = No. of successes")
axs[0].legend()
axs[0].set_yticks([])
axs[0].tick_params(labelsize=8)
az.plot_bpv(idata_pp_test, kind='t_stat', t_stat='mean', data_pairs={
'y_obs': 'y_star'}, plot_mean=False, ax=axs[1], bpv=False)
axs[1].axvline(Y_test.mean(), ls="--", color="r",
lw=2, label=r"$\bar Y_{test}$")
handles, labels = axs[1].get_legend_handles_labels()
handles.extend([Line2D([0], [0], label=r"Distribution of $\bar Y_{test}^*$")])
axs[1].legend(handles=handles)
# Separation plot
az.plot_separation(idata_pp_test, y="y_obs", y_hat="p_star", y_hat_line=True,
figsize=(10, 1), legend=False)
plt.title("Separation plot", fontsize=12)
# Show Bayesian p-values
for name, stat in statistics:
bpv = utils.bpv(pp_test_y, Y_test, stat)
print(f"bpv [T={name}]: {bpv:.3f}")
In [25]:
# -- Compute metrics using several point estimates
df_metrics_emcee = pd.DataFrame(columns=results_columns)
# Posterior mean estimate
Y_hat_pp_mean = [utils.threshold(y)
for y in pp_test_p[:, ::thin_pp, :].mean(axis=(0, 1))]
metrics_pp_mean = utils.classification_metrics(Y_test, Y_hat_pp_mean)
Y_hat_pp_vote = [utils.threshold(y)
for y in pp_test_y[:, ::thin_pp, :].mean(axis=(0, 1))]
metrics_pp_vote = utils.classification_metrics(Y_test, Y_hat_pp_vote)
df_metrics_emcee.loc[0] = [
"emcee_posterior_mean",
p_hat,
metrics_pp_mean["acc"]
]
df_metrics_emcee.loc[1] = [
"emcee_posterior_vote",
p_hat,
metrics_pp_vote["acc"]
]
# Point estimates
for i, pe in enumerate(point_estimates):
Y_hat_pe = utils.point_predict(
X_test, idata_emcee,
theta_names, pe, kind='classification')
metrics_pe = utils.classification_metrics(Y_test, Y_hat_pe)
df_metrics_emcee.loc[i + 2] = [
"emcee_" + pe,
p_hat,
metrics_pe["acc"],
]
df_metrics_emcee.sort_values(
results_columns[-1], inplace=True, ascending=False)
df_metrics_emcee.style.hide_index()
Out[25]:
In [26]:
# -- Test variable selection procedure
df_metrics_emcee_var_sel = pd.DataFrame(columns=results_columns)
for pe in point_estimates:
df_var_sel = bayesian_var_sel(
idata_emcee, theta_space, theta_names, X_fd,
Y, X_test_fd, Y_test, folds, prefix="emcee",
point_est=pe)
df_metrics_emcee_var_sel = df_metrics_emcee_var_sel.append(df_var_sel)
df_metrics_emcee_var_sel.sort_values(
results_columns[-1], inplace=True, ascending=False)
df_metrics_emcee_var_sel.style.hide_index()
Out[26]:
Save & Load¶
This is only for testing purposes; in a production environment one should use the Backends feature of emcee.
In [ ]:
# -- Save
with open("emcee-p-fixed.idata", 'wb') as file:
pickle.dump(idata_emcee, file)
In [ ]:
# -- Load
with open("emcee-p-fixed.idata", 'rb') as file:
idata_emcee = pickle.load(file)
trace = idata_emcee.posterior.to_array().to_numpy().T
trace_flat = trace.reshape(-1, trace.shape[-1]) # All chains combined
The PyMC library¶
In [27]:
import pymc3 as pm
import theano
import theano.tensor as tt
Model¶
In [28]:
# -- Probabilistic model
def make_model(theta_space, g, eta, X, Y, names, names_aux, mle_theta=None):
n, N = X.shape
grid = theta_space.grid
p = theta_space.p
if mle_theta is not None:
b0 = mle_theta[:p]
else:
b0 = g*rng.standard_normal(size=p) # <-- Change if needed
with pm.Model() as model:
X_pm = pm.Data('X', X)
alpha0_and_log_sigma = pm.DensityDist(
names_aux[0], lambda x: 0, shape=(2,))
alpha0 = pm.Deterministic(names[-2], alpha0_and_log_sigma[0])
log_sigma = alpha0_and_log_sigma[1]
sigma = pm.math.exp(log_sigma)
sigma2 = pm.Deterministic(names[-1], sigma**2)
tau = pm.Uniform(names[1], 0.0, 1.0, shape=(p,))
idx = np.abs(grid - tau[:, np.newaxis]).argmin(1)
X_tau = X_pm[:, idx]
G_tau = pm.math.matrix_dot(X_tau.T, X_tau)
G_tau = (G_tau + G_tau.T)/2. # Enforce symmetry
G_tau_reg = G_tau + eta * \
tt.max(tt.nlinalg.eigh(G_tau)[0])*np.identity(p)
def beta_lprior(x):
b = x - b0
return (0.5*pm.math.logdet(G_tau_reg)
- p*log_sigma
- pm.math.matrix_dot(b.T, G_tau_reg, b)/(2.*g*sigma2))
beta = pm.DensityDist(names[0], beta_lprior, shape=(p,))
px = pm.Deterministic(
'p_star',
pm.math.invlogit(alpha0 + pm.math.matrix_dot(X_tau, beta)))
y_obs = pm.Bernoulli('y_obs', p=px, observed=Y)
return model
Experiments¶
In [29]:
# -- Hyperparameters
burn = 0
thin = 1
thin_pp = 5
n_samples_nuts = 1000
tune_nuts = 1200
target_accept = 0.81
n_samples_metropolis = 10000
tune_metropolis = 3000
USE_NUTS = False
In [30]:
# -- Run sampler
model = make_model(theta_space, g, eta, X, Y, theta_names,
theta_names_aux[:1], mle_theta_tr)
with model:
if USE_NUTS:
idata_pymc = pm.sample(n_samples_nuts, cores=2,
tune=tune_nuts, target_accept=0.81,
return_inferencedata=True)
else:
step = pm.Metropolis()
idata_pymc = pm.sample(n_samples_metropolis, cores=2,
tune=tune_metropolis, step=step,
return_inferencedata=True)
idata_pymc = idata_pymc.sel(draw=slice(burn, None, thin))
Analysis¶
Since the tuning iterations already serve as burn-in, we keep the whole trace. In addition, we could consider thinning the samples.
In [31]:
utils.summary(idata_pymc, var_names=theta_names, labeller=theta_labeller)
Out[31]:
In [32]:
az.plot_trace(idata_pymc, var_names=theta_names, labeller=theta_labeller)
print("Density and trace plot:")
In [33]:
az.plot_posterior(
idata_pymc, point_estimate='mode',
var_names=theta_names,
labeller=theta_labeller,
textsize=20,
grid=(NROWS(theta_ndim), NCOLS))
print("Marginal posterior distributions:")
In [34]:
# -- Generate and plot posterior predictive samples from X
with model:
print("Generating posterior predictive samples...")
pp_p, pp_y = utils.generate_pp(
idata_pymc, X, theta_names, rng=rng, kind='classification')
utils.pp_to_idata([pp_p, pp_y], idata_pymc,
['p_star', 'y_star'], merge=True)
# Posterior predictive checks
fig, axs = plt.subplots(1, 2, figsize=(10, 4))
plt.suptitle(r"Posterior predictive checks on $X$")
n_success = pp_y.reshape(-1, len(Y)).sum(axis=1)
az.plot_dist(n_success, label=r"$T(Y^*)$", ax=axs[0])
axs[0].axvline(n_success.mean(), ls="--", color="orange",
lw=2, label=r"$\overline{T(Y^*)}$")
axs[0].axvline(Y.sum(), ls="--", color="red",
lw=2, label=r"$T(Y)$")
axs[0].set_title("T = No. of successes")
axs[0].legend()
axs[0].set_yticks([])
axs[0].tick_params(labelsize=8)
az.plot_bpv(idata_pymc, kind='t_stat', t_stat='mean',
plot_mean=False, ax=axs[1], bpv=False,
data_pairs={"y_obs": "y_star"})
axs[1].axvline(Y.mean(), ls="--", color="r",
lw=2, label=r"$\bar Y$")
handles, labels = axs[1].get_legend_handles_labels()
handles.extend([Line2D([0], [0], label=r"Distribution of $\bar Y^*$")])
axs[1].legend(handles=handles)
# Separation plot
az.plot_separation(idata_pymc, y="y_obs", y_hat="p_star", y_hat_line=True,
figsize=(10, 1), legend=False)
plt.title("Separation plot", fontsize=12)
# Show Bayesian p-values
for name, stat in statistics:
bpv = utils.bpv(pp_y, Y, stat)
print(f"bpv [T={name}]: {bpv:.3f}")
In [35]:
az.plot_autocorr(idata_pymc, var_names=theta_names,
combined=True, grid=(NROWS(theta_ndim), NCOLS),
labeller=theta_labeller)
print("Combined autocorrelation times:")
In [39]:
print("Graphical model:")
pm.model_graph.model_to_graphviz(model)
Out[39]:
Out-of-sample predictions¶
First we take a look at the distribution of predictions on a previously unseen dataset.
In [36]:
# -- Generate and plot posterior predictive samples from X_test
model_test = make_model(theta_space, g, eta, X_test, Y_test, theta_names,
theta_names_aux[:1], mle_theta)
with model_test:
print("Generating posterior predictive on hold-out data...")
pp_test_p, pp_test_y = utils.generate_pp(
idata_pymc, X_test, theta_names, rng=rng, kind='classification')
idata_pp_test = utils.pp_to_idata(
[pp_test_p, pp_test_y], idata_pymc,
['p_star', 'y_star'], y_obs=Y_test)
# Posterior predictive checks
fig, axs = plt.subplots(1, 2, figsize=(10, 4))
plt.suptitle(r"Posterior predictive checks on $X_{test}$")
n_success_test = pp_test_y.reshape(-1, len(Y_test)).sum(axis=1)
az.plot_dist(n_success_test, label=r"$T(Y_{test}^*)$", ax=axs[0])
axs[0].axvline(n_success_test.mean(), ls="--", color="orange",
lw=2, label=r"$\overline{T(Y_{test}^*)}$")
axs[0].axvline(Y_test.sum(), ls="--", color="red",
lw=2, label=r"$T(Y_{test})$")
axs[0].set_title("T = No. of successes")
axs[0].legend()
axs[0].set_yticks([])
axs[0].tick_params(labelsize=8)
az.plot_bpv(idata_pp_test, kind='t_stat', t_stat='mean',
plot_mean=False, ax=axs[1], bpv=False,
data_pairs={"y_obs": "y_star"})
axs[1].axvline(Y_test.mean(), ls="--", color="r",
lw=2, label=r"$\bar Y_{test}$")
handles, labels = axs[1].get_legend_handles_labels()
handles.extend([Line2D([0], [0], label=r"Distribution of $\bar Y_{test}^*$")])
axs[1].legend(handles=handles)
# Separation plot
az.plot_separation(idata_pp_test, y="y_obs", y_hat="p_star",
y_hat_line=True, figsize=(10, 1), legend=False)
plt.title("Separation plot", fontsize=12)
# Show Bayesian p-values
for name, stat in statistics:
bpv = utils.bpv(pp_test_y, Y_test, stat)
print(f"bpv [T={name}]: {bpv:.3f}")
Next we look at the MSE when using several point-estimates for the parameters.
In [37]:
# -- Compute metrics using several point estimates
df_metrics_pymc = pd.DataFrame(columns=results_columns)
# Posterior mean estimate
Y_hat_pp_mean = [utils.threshold(y)
for y in pp_test_p[:, ::thin_pp, :].mean(axis=(0, 1))]
metrics_pp_mean = utils.classification_metrics(Y_test, Y_hat_pp_mean)
Y_hat_pp_vote = [utils.threshold(y)
for y in pp_test_y[:, ::thin_pp, :].mean(axis=(0, 1))]
metrics_pp_vote = utils.classification_metrics(Y_test, Y_hat_pp_vote)
df_metrics_pymc.loc[0] = [
"pymc_posterior_mean",
p_hat,
metrics_pp_mean["acc"]
]
df_metrics_pymc.loc[1] = [
"pymc_posterior_vote",
p_hat,
metrics_pp_vote["acc"]
]
# Point estimates
for i, pe in enumerate(point_estimates):
Y_hat_pe = utils.point_predict(
X_test, idata_pymc,
theta_names, pe, kind='classification')
metrics_pe = utils.classification_metrics(Y_test, Y_hat_pe)
df_metrics_pymc.loc[i + 2] = [
"pymc_" + pe,
p_hat,
metrics_pe["acc"],
]
df_metrics_pymc.sort_values(results_columns[-1], inplace=True, ascending=False)
df_metrics_pymc.style.hide_index()
Out[37]:
In [38]:
# -- Test variable selection procedure
df_metrics_pymc_var_sel = pd.DataFrame(columns=results_columns)
for pe in point_estimates:
df_var_sel = bayesian_var_sel(
idata_pymc, theta_space, theta_names, X_fd,
Y, X_test_fd, Y_test, folds, prefix="pymc",
point_est=pe)
df_metrics_pymc_var_sel = df_metrics_pymc_var_sel.append(df_var_sel)
df_metrics_pymc_var_sel.sort_values(
results_columns[-1], inplace=True, ascending=False)
df_metrics_pymc_var_sel.style.hide_index()
Out[38]:
Save & Load¶
In [ ]:
# -- Save
_ = idata_pymc.to_netcdf("pymc-p-fixed.nc")
In [ ]:
# -- Load
idata_pymc = az.from_netcdf("pymc-p-fixed.nc")
Notebook metadata¶
In [40]:
%load_ext watermark
%watermark -n -u -v -iv -w